An algorithm for linearly constrained programs with a partly linear objective function
نویسندگان
چکیده
منابع مشابه
A matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملAn Accelerated Proximal Gradient Algorithm for Singly Linearly Constrained Quadratic Programs with Box Constraints
Recently, the existed proximal gradient algorithms had been used to solve non-smooth convex optimization problems. As a special nonsmooth convex problem, the singly linearly constrained quadratic programs with box constraints appear in a wide range of applications. Hence, we propose an accelerated proximal gradient algorithm for singly linearly constrained quadratic programs with box constraint...
متن کاملA Scalable Parallel Algorithm for Multiple Objective Linear Programs
This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLPs). Job balance, speedup and scalability are of primary interest in evaluating e ciency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm signi cantly speeds up the process of solving MOLPs, which is understood as generating al...
متن کاملAn Algorithm for Global Minimization of Linearly Constrained Quadratic Functions
A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.
متن کاملa matrix lsqr algorithm for solving constrained linear operator equations
in this work, an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$ and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$ where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$, $mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$, $ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1992
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90033-h